Foundations of disjunctive logic programming
نویسندگان
چکیده
منابع مشابه
Disjunctive Logic Programming as
Earlier, we have proposed a logic, called priority logic 16, 18], where a theory consists of a collection of logic programming-like inference rules (without default negation) and a priority constraint among them. We showed that nonmonotonic reasoning in general can be viewed as a reasoning based on selecting monotonic inferences that satisfy the speciied priority constraints. The goal of this p...
متن کاملProbabilistic Disjunctive Logic Programming
In this paper we propose a framework for combining Disjunctive Logic Programming and Poole's Probabilistic Horn Abduction. We use the concept of hypothesis to spec ify the probability structure. We consider the case in which probabilistic information is not available. Instead of using probability intervals, we allow for the specification of the probabilities of disjunctions. Because mini mal ...
متن کاملCalculi for Disjunctive Logic Programming
In this paper we investigate relationships between top-down and bottomup approaches to computation with disjunctive logic programs (DLPs). The bottom-up calculus considered, hyper tableaux, is depicted in its ground version and its relation to fixed point approaches from the literature is investigated. For the top-down calculus we use restart model elimination (RME) and show as our main result ...
متن کاملDisjunctive Logic Programming and Autoepistemic Logic
In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two different types of negative introspection in autoepistemic reasoning present two different interpretations of default negation: consistency-based and minimal-model-based. We also observed that all logic program semantics fall into ...
متن کاملFirst-Order Disjunctive Logic Programming vs Normal Logic Programming
In this paper, we study the expressive power of firstorder disjunctive logic programming (DLP) and normal logic programming (NLP) under the stable model semantics. We show that, unlike the propositional case, first-order DLP is strictly more expressive than NLP. This result still holds even if auxiliary predicates are allowed, assuming NP 6= coNP. On the other side, we propose a partial transla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1995
ISSN: 0167-6423
DOI: 10.1016/0167-6423(95)90011-x